منابع مشابه
Convexity and Haar Null Sets
It is shown that for every closed, convex and nowhere dense subset C of a superreflexive Banach space X there exists a Radon probability measure μ on X so that μ(C + x) = 0 for all x ∈ X. In particular, closed, convex, nowhere dense sets in separable superreflexive Banach spaces are Haar null. This is unlike the situation in separable nonreflexive Banach spaces, where there always exists a clos...
متن کاملLOCAL CONVEXITY AND Ln SETS1
We will prove that a closed connected set S in ET whose points of local nonconvexity can be decomposed into a finite number of convex parts also possesses a simple type of polygonal connectedness. Furthermore, if S has a finite number of points of local nonconvexity, we obtain another result. In order to describe this situation easily we use the notation of Ln set used by Horn and Valentine [l ...
متن کاملLocal Polynomial Convexity
We begin with the following question: given a closed disc D ⋐ C and a complex-valued function F ∈ C(D), is the uniform algebra on D generated by z and F equal to C(D) ? This question is complicated by the presence of points in the surface S := graph D (F) that have complex tangents. Such points are called CR singularities. Let p ∈ S be a CR singularity at which the order of contact of the tange...
متن کاملSets of probability distributions, independence, and convexity
This paper analyzes concepts of independence and assumptions of convexity in the theory of sets of probability distributions. The starting point is Kyburg and Pittarelli’s discussion of “convex Bayesianism” (in particular their proposals concerning E-admissibility, independence, and convexity). The paper offers an organized review of the literature on independence for sets of probability distri...
متن کاملSeparability and Convexity of Probabilistic Point Sets ∗
We describe an O(n) time algorithm for computing the exact probability that two probabilistic point sets are linearly separable in dimension d ≥ 2, and prove its hardness via reduction from the k-SUM problem. We also show that d-dimensional separability is computationally equivalent to a (d+ 1)-dimensional convex hull membership problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1965
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1965-0185510-6